منابع مشابه
The Constructive Lift Monad
The lift monad is the construction which to a poset freely adjoins a bottom element to it, or equivalently (from the classical viewpoint), the construction which freely adjoins suprema for subsets with at most one element. In constructive mathematics (i.e. inside a topos), these two constructions are no longer equivalent, since the equivalence is based on the boolean reasoning that a set with a...
متن کاملThe Isbell monad
Article history: Received 30 October 2014 Accepted 6 January 2015 Available online xxxx Communicated by Ross Street MSC: 18A32 18B15
متن کاملThe Monad . Reader
The barbarians are at the gates. Hordes of Java programmers are being exposed to generics and delegates; hundreds of packages have been uploaded to Hackage; the Haskell IRC channel has nearly hit 500 users; and it's only a matter of time before Microsoft seals that multi-billion dollar bid for Hayoo. The time has come to retreat and climb higher into our ivory tower: we need to design a languag...
متن کاملThe Quantum IO Monad
We present an interface from Haskell to quantum programming: the Quantum IO monad, and use it to implement Shor’s factorisation algorithm. The QIO monad separates reversible (i.e. unitary) and irreversible (i.e. probabilistic) computations and provides a reversible let operation (ulet), allowing us to use ancillas (auxiliary qubits) in a modular fashion. Exploiting Haskell’s class system we can...
متن کاملThe proof monad
A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to describe the computational features of proof languages, such as side effects, exception handling, and backtracking. The formalism, called proof monads, finds its roots in category theory, and in particular satisfies t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1995
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v2i20.19922